Pseudo-Boolean valued prolog
نویسنده
چکیده
Logic programming has generally been developed in a Classical two-valued setting; there are no “degrees of truth”. What we propose here is the introduction of more general spaces of truth values, reading truth values as “evidence factors”. Then conventional logic programming may be seen as the special case in which only total evidence is acceptable, and so the space of evidences degenerates to two values: evidence for; no evidence for.
منابع مشابه
Une introduction à Prolog III
The Prolog III programming language extends Prolog by redefining the fundamental process at its heart : unification. Into this mechanism, Prolog III integrates refined processing of trees and lists, number processing, and processing of two-valued Boolean algebra. We present the specification of this new language and illustrate its capabilities by means of varied examples. We also present the th...
متن کاملLogic Programming with Pseudo-Boolean Constraints
Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...
متن کاملOn the Arity Gap of Finite Functions: Results and Applications
Let A be a finite set and B an arbitrary set with at least two elements. The arity gap of a function f : An → B is the minimum decrease in the number of essential variables when essential variables of f are identified. A non-trivial fact is that the arity gap of such B-valued functions on A is at most |A|. Even less trivial to verify is the fact that the arity gap of B-valued functions on A wit...
متن کاملA General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT
Jain et al. [4] recently introduced a new no-good learning approach for multivalued satisfaction (MV-SAT) problems. This approach was shown to infer significantly stronger no-goods than those inferred by a mechanism that is based on a Boolean representation of a multi-valued problem as a SAT instance. Like earlier methods, the learning approach is based on an implication graph where nodes repre...
متن کاملBoolean and Central Elements and Cantor-Bernstein Theorem in Bounded Pseudo-BCK-Algebras?
Georgescu and Iorgulescu [3] introduced pseudo-BCK-algebras (in a slightly different way) as a non-commutative generalization of BCK-algebras, in the sense that if →= , then the algebra (A,→, 1) is a BCK-algebra. Pseudo-BCK-algebras relate to (non-commutative) residuated lattices as BCK-algebras do to commutative residuated lattices; specifically, by [6], pseudoBCK-algebras are just the 〈→, , 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 47 شماره
صفحات -
تاریخ انتشار 1988